Golomb Rulers: The Advantage of Evolution
نویسندگان
چکیده
In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solutions and that can be considered as a realistic alternative to massive parallel approaches that need several months or years to discover high quality Golomb rulers.
منابع مشابه
A review of the available construction methods for Golomb rulers
We collect the main construction methods for Golomb rulers available in the literature along with their proofs. In particular, we demonstrate that the Bose-Chowla method yields Golomb rulers that appear as the main diagonal of a special subfamily of Golomb Costas arrays. We also show that Golomb rulers can be composed to yield longer Golomb rulers.
متن کاملConstructing Optimal Golomb Rulers in Parallel
In this paper, a construction of the Golomb optimal rulers is studied with a tree search approach. Improvements to the basic algorithm are given and it is parallelized using a shared memory. The application associated to this approach is written in C using the standard OpenMP and MPI libraries. The algorithm takes advantage of a collaboration mechanism between the processors. Different load bal...
متن کاملEnumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs
A Golomb ruler is a sequence of distinct integers (the markings of the ruler) whose pairwise differences are distinct. Golomb rulers, also known as Sidon sets and B2 sets, can be traced back to additive number theory in the 1930s and have attracted recent research activities on existence problems, such as the search for optimal Golomb rulers (those of minimal length given a fixed number of mark...
متن کاملOn the Design of Optimum Order 2 Golomb Ruler
A Golomb ruler with M marks can be defined as a set {ai} of integers so that all differences δij = aj − ai, i 6= j, are distinct. An order 2 Golomb ruler is a Golomb ruler such that all differences δijk` = |δk` − δij |, {i, j} 6 = {k, `}, are distinct as much as possible. Contruction of optimum order 2 Golomb ruler, i.e., of rulers of minimum length, is a highly combinatorial problem which has ...
متن کاملGenetic Algorithm Approach to the Search for Golomb Rulers
GOLOMB RULERS Stephen W. Soliday soliday@gar eld.ncat.edu Abdollah Homaifar homaifar@gar eld.ncat.edu Department of Electrical Engineering North Carolina A&T State University Greensboro, North Carolina 27411 Gary L. Lebby lebby@gar eld.ncat.edu Abstract The success of genetic algorithm in nding relatively good solutions to NP-complete problems such as the traveling salesman problem and job-shop...
متن کامل